Facility location for an extraterrestrial production/distribution system

This paper extends traditional production/distribution system analysis to address raw material, factories, and markets located beyond Earth. It explains the eventual advantages of such operations and discusses likely sites in the solar system. It furnishes a typology for production/distribution systems, assessing the fit of each type to space operations. It briefly reviews the physics of orbits. It develops transportation and inventory cost functions for the simplest case of Hohmann trajectories, and for transportation between circular orbits of similar radii using higher‐energy trajectories. These cost functions are used to derive a model of production/distribution system cost, the minimization of which selects an optimal factory location. The paper suggests potential extensions to this work, and concludes with ideas for location research on the novel reaches of extraterrestrial space. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

基于四面体六棱长的三站测时差立体定位方法

针对在三站测时差立体定位中辐射源位置不能唯一确定的情形,提出一种简单易懂、计算方便、可操作性强的解析解方法,以解决求解双曲面方程组的繁琐问题。首先利用三站相互之间的距离、由量测时差值换算得到的两个距离差值,以及辐射源至主站的距离(设为变量r)总共6个参数,立足于已知6条边长判断能否构成四面体的理论,求得r的取值范围;然后在r的值域范围内任意给定某个具体值,加上已知三站的地理位置,通过解三元一次方程组的形式获得目标在三站所在平面内垂直投影的坐标(设为变量X_h),并计算出目标至垂直投影的距离(设为变量h);最后由X_h和h给出目标在地心地固直角坐标系下的坐标。     

基于GA-ML-PMHT的多基站无源协同定位方法

针对无源协同定位系统中低可观测目标的航迹初始及维持问题,提出一种基于遗传算法的极大似然概率多假设的多基站无源协同定位方法。首先,建立多基站无源协同定位系统数学模型。其次,提出基于极大似然概率多假设的无源协同定位航迹初始算法,并首次利用遗传算法解决极大似然概率多假设中的优化求解问题,以提高目标检测跟踪性能。最后,通过滑窗法实现航迹维持。仿真结果表明,所提方法能够有效解决多基站无源协同定位系统中低可观测目标的航迹初始及维持问题。     

海天背景下舰船可见光图像目标区域定位方法

针对行均值法用于海天背景下舰船目标区域定位可靠性不高、容易受到舰船目标大小和海天背景复杂程度影响的不足,提出一种基于图像行灰度熵的舰船目标区域定位方法。该方法在分析海天背景下舰船目标可见光图像成像特点基础上,结合信息熵理论给出了图像灰度熵及行灰度熵的概念,利用图像行灰度熵描述图像在行方向上的灰度变化程度,选用滑动区间方差搜索策略得到图像行灰度熵曲线的突变区间,从而实现舰船目标区域定位,最后通过实际图像进行了实验验证。实验结果表明,该方法能对舰船目标所在区域有效定位,其准确性及鲁棒性均优于行均值法。     

双基地中两坐标收站的三维定位跟踪算法

文中讨论了Ｔ／Ｒ—Ｒ型双基地系统中无俯仰信息收站对运动目标的三维定位跟踪能力;通过若干观测点上测量数据的组合,较好地实现厂对运动目标的三维定位跟踪,从而可以将目标的高度信息从变化的距离和之差的测最值中提取出来。文中以仿真手段证明了这种方法的可行性。     

双基地系统收站自主的自适应跟踪算法

本文介绍了双基地系统收站自主的定位原理及跟踪算法WMEKF (WeightedModified Extended Kalman Filter),提出了一种对机动目标的自适应跟踪算法AWMEKF(Adaptive WMEKF),并对典型的机动目标航迹进行了计算机仿真。     

网络雷阵及其被动定位原理

对网络水雷阵的概念进行了讨论 ,明确了几项系统关键技术 .提出了一种网络传感器纯方位目标定位算法 .该算法构思巧妙 ,用途广泛 .     

一种基于Jerk模型的机动目标单站无源定位算法

针对采用非线性较强的观测角、角度变化率、脉冲到达时间差等参数的单站无源定位跟踪系统,提出了一种新的跟踪滤波算法IMM-Jerk。该方法用Jerk模型对做复杂机动的运动目标建模,采用经过UKF滤波改进的交互多模(IMM)算法对目标实现跟踪滤波。该算法可适用于对做多种机动运动的目标的跟踪,提高了目标跟踪收敛精度和跟踪系统的稳定性。仿真试验证明了该方法的可行性和有效性,并具有较高的应用价值。最后,对IMM-Jerk算法的研究方向进行了讨论。     

Discriminating between the Weibull and log‐normal distributions

Log‐normal and Weibull distributions are the most popular distributions for modeling skewed data. In this paper, we consider the ratio of the maximized likelihood in choosing between the two distributions. The asymptotic distribution of the logarithm of the maximized likelihood ratio has been obtained. It is observed that the asymptotic distribution is independent of the unknown parameters. The asymptotic distribution has been used to determine the minimum sample size required to discriminate between two families of distributions for a user specified probability of correct selection. We perform some numerical experiments to observe how the asymptotic methods work for different sample sizes. It is observed that the asymptotic results work quite well even for small samples also. Two real data sets have been analyzed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Facility location models for immobile servers with stochastic demand

This paper presents several models for the location of facilities subject to congestion. Motivated by applications to locating servers in communication networks and automatic teller machines in bank systems, these models are developed for situations in which immobile service facilities are congested by stochastic demand originating from nearby customer locations. We consider this problem from three different perspectives, that of (i) the service provider (wishing to limit costs of setup and operating servers), (ii) the customers (wishing to limit costs of accessing and waiting for service), and (iii) both the service provider and the customers combined. In all cases, a minimum level of service quality is ensured by imposing an upper bound on the server utilization rate at a service facility. The latter two perspectives also incorporate queueing delay costs as part of the objective. Some cases are amenable to an optimal solution. For those cases that are more challenging, we either propose heuristic procedures to find good solutions or establish equivalence to other well‐studied facility location problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.